Mathematical formulation and heuristic algorithm for the block relocation and loading problem

This study considers the block relocation and loading problem in container terminals. The optimal loading sequence and relocation location are simultaneously decided on the basis of the desired ship‐bay and initial yard space configuration. An integer linear programming model is developed to minimize the number of relocations in the yard space on the basis of no shifts in the ship bay. The accuracy of the model is tested on small‐scale scenarios by using CPLEX. Considering the problem size in the real world, we present a rule‐based heuristic method that is combined with a mathematical model for the removal, loading, and relocation operations. The influence of rules on algorithm performance is also analyzed, and the heuristic algorithm is compared with different types of algorithms in the literature. The extensive numerical experiments show the efficiency of the proposed heuristic algorithm.     

装甲装备橡胶器材防老化涂料的制备

以有机硅改性丙烯酸乳液为基料,制备了具有一定弹性和抗老化性的装甲装备橡胶器材防护涂料,并对涂料的耐湿热性、耐盐雾性进行了测试。结果表明:纳米硅丙涂料是一种综合性能优异的装甲装备橡胶器材防老化涂料,能够有效地延长橡胶器材的库存寿命。     

金属橡胶阻尼板简支结构性能实验研究

采用等效线性化法来分析金属橡胶粘性阻尼双线性迟滞模型,得出了新的等效刚度与阻尼的变化规律,并用金属橡胶阻尼板简支结构谐振实验进行了验证,为金属橡胶材料的运用提供了依据。     

The assignment of storage locations to containers for a container stack

Assigning storage locations to incoming or reshuffled containers is a fundamental problem essential to the operations efficiency of container terminals. The problem is notoriously hard for its combinatorial and dynamic nature. In this article, we minimize the number of reshuffles in assigning storage locations for incoming and reshuffled export containers. For the static problem to empty a given stack without any new container arrival, the optimum reshuffle sequence is identified by an integer program (IP). The integer program captures the evolution of stack configurations as a function of decisions and is of interest by itself. Heuristics based on the integer program are then derived. Their competitiveness in accuracy and time are established by extensive numerical runs comparing them with existing heuristics in literature and in practice as well as with extensions of the existing heuristics. Variants of the IP‐based heuristics are then applied to the dynamic problem with continual retrievals and arrivals of containers. Again, numerical runs confirm that the IP‐based heuristic is competitive. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2009